On the internal distance in the interlacement set
نویسندگان
چکیده
We prove a shape theorem for the internal (graph) distance on the interlacement set I of the random interlacement model on Z, d ≥ 3. We provide large deviation estimates for the internal distance of distant points in this set, and use these estimates to study the internal distance on the range of a simple random walk on a discrete torus.
منابع مشابه
Connectivity properties of random interlacement and intersection of random walks
We consider the interlacement Poisson point process on the space of doubly-infinite Z-valued trajectories modulo time shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least one of these trajectories is the random interlacement at level u of Sznitman (2010). We prove that for any u > 0, almost surely, (1) any two vertices in the rand...
متن کاملThe effect of small quenched noise on connectivity properties of random interlacements∗
Random interlacements (at level u) is a one parameter family of random subsets of Z introduced by Sznitman in [22]. The vacant set at level u is the complement of the random interlacement at level u. While the random interlacement induces a connected subgraph of Z for all levels u, the vacant set has a non-trivial phase transition in u, as shown in [22] and [19]. In this paper, we study the eff...
متن کاملThe Impact of Contextual Variables on Internal Intensification of Apology Speech Acts in Persian: Social Distance and Severity of Offense in Focus
The current paper primarily provides an account of how apology speech acts are internally intensified in Persian. Moreover, the study checks to what extent contextual variables, namely social distance and severity of offense, may motivate the internal intensification of apology speech acts. To these ends, the study collected the required speech acts through a Discourse Completion Test (DCT) fro...
متن کاملOn the Transience of Random Interlacements
Abstract We consider the interlacement Poisson point process on the space of doubly-infinite Zd -valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least one of these trajectories is the graph induced by the random interlacements at level u of Sznitman [9]. We prove that for any u> 0, almost surely, the...
متن کاملIRDDS: Instance reduction based on Distance-based decision surface
In instance-based learning, a training set is given to a classifier for classifying new instances. In practice, not all information in the training set is useful for classifiers. Therefore, it is convenient to discard irrelevant instances from the training set. This process is known as instance reduction, which is an important task for classifiers since through this process the time for classif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012